Computing Galois groups over the rationals
نویسندگان
چکیده
منابع مشابه
Computing Pro-P Galois Groups
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois group. In the infinite case it produces a family or few families of likely candidates.
متن کاملGalois Groups over Nonrigid Fields
Let F be a field with charF 6= 2. We show that there are two groups of order 32, respectively 64, such that a field F with char F 6= 2 is nonrigid if and only if at least one of the two groups is realizable as a Galois group over F . The realizability of those groups turns out to be equivalent to the realizability of certain quotients (of order 16, respectively 32). Using known results on conne...
متن کاملComputing Galois Groups with Generic Resolvent Polynomials
Given an arbitrary irreducible polynomial f with rational coefficients it is difficult to determine the Galois group of the splitting field of that polynomial. When the roots of f are easy to calculate, there are a number of “tricks” that can be employed to calculate this Galois group. If the roots of f are solvable by radicals, for example, it is often easy to calculate by hand the Q-fixing au...
متن کاملComputation of Galois groups over function fields
Symmetric function theory provides a basis for computing Galois groups which is largely independent of the coefficient ring. An exact algorithm has been implemented over Q(t1, t2, . . . , tm) in Maple for degree up to 8. A table of polynomials realizing each transitive permutation group of degree 8 as a Galois group over the rationals is included.
متن کاملAverage Frobenius Distribution for Elliptic Curves Defined over Finite Galois Extensions of the Rationals
Let K be a fixed number field, assumed to be Galois over Q. Let r and f be fixed integers with f positive. Given an elliptic curve E, defined over K, we consider the problem of counting the number of degree f prime ideals of K with trace of Frobenius equal to r. Except in the case f = 2, we show that “on average,” the number of such prime ideals with norm less than or equal to x satisfies an as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1985
ISSN: 0022-314X
DOI: 10.1016/0022-314x(85)90022-8